A Worst-Case to Average-Case Connection for CVP
نویسنده
چکیده
We prove a connection of the worst-case complexity and the average-case complexity for the Closest Vector Problem (CVP) for lattices. Assume that there is an eecient algorithm which can solve approximately a random instance of CVP for lattices under a certain natural distribution, at least with a non-trivial success probability over this distribution, we show that one can approximately solve several lattice problems (including CVP) for every lattice with high probability.
منابع مشابه
On the Average-Case Hardness of CVP
We prove a connection of the worst-case complexity to the average-case complexity based on the Closest Vector Problem (CVP) for lattices. Assume that there is an efficient algorithm which can solve approximately a random instance of CVP, with a non-trivial success probability, for lattices under a certain natural distribution, we show that one can approximately solve several lattice problems (i...
متن کاملAn Improved Worst - Case to Average - CaseConnection
We improve a connection of the worst-case complexity and the average-case complexity of some well-known lattice problems. This fascinating connection was rst discovered by Ajtai 1] in 1996. We improve the exponent of this connection from 8 to 3:5 + .
متن کاملSome Results on Average-Case Hardness Within the Polynomial Hierarchy
We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-uniform complexity of optimization problems. Specifically, we show that if P is hard in the worst-case then it is either hard on the average (in the sense of Levin) or it is non-uniformly hard (i.e. it does not have small circuits)...
متن کاملToward Basing Fully Homomorphic Encryption on Worst-Case Hardness
Gentry proposed a fully homomorphic public key encryption scheme that uses ideal lattices. He based the security of his scheme on the hardness of two problems: an average-case decision problem over ideal lattices, and the sparse (or “low-weight”) subset sum problem (SSSP). We provide a key generation algorithm for Gentry’s scheme that generates ideal lattices according to a “nice” average-case ...
متن کاملClosest Vector Problem
The Closest Vector Problem (CVP) is a computational problem on lattices closely related to SVP. (See Shortest Vector Problem.) Given a lattice L and a target point ~x, CVP asks to find the lattice point closest to the target. As for SVP, CVP can be defined with respect to any norm, but the Euclidean norm is the most common (see the entry lattice for a definition). A more relaxed version of the ...
متن کامل